Dynamical selection of Nash equilibria using Experience Weighted Attraction Learning: emergence of heterogeneous mixed equilibria
نویسندگان
چکیده
We study the distribution of strategies in a large game that models how agents choose among different double auction markets. We classify the possible mean field Nash equilibria, which include potentially segregated states where an agent population can split into subpopulations adopting different strategies. As the game is aggregative, the actual equilibrium strategy distributions remain undetermined, however. We therefore compare with the results of Experience-Weighted Attraction (EWA) learning, which at long times leads to Nash equilibria in the appropriate limits of large intensity of choice, low noise (long agent memory) and perfect imputation of missing scores (fictitious play). The learning dynamics breaks the indeterminacy of the Nash equilibria. Non-trivially, depending on how the relevant limits are taken, more than one type of equilibrium can be selected. These include the standard homogeneous mixed and heterogeneous pure states, but also heterogeneous mixed states where different agents play different strategies that are not all pure. The analysis of the EWA learning involves FokkerPlanck modeling combined with large deviation methods. The theoretical results are confirmed by multi-agent simulations.
منابع مشابه
Finite Population Dynamics and Mixed Equilibria
This paper examines the stability of mixed-strategy Nash equilibria of symmetric games, viewed as population profiles in dynamical systems with learning within a single, finite population. Alternative models of imitation and myopic best reply are considered under different assumptions on the speed of adjustment. It is found that two specific refinements of mixed Nash equilibria identify focal r...
متن کاملLearning Processes, Mixed Equilibria and Dynamical Systems Arising from Repeated Games
Fudenberg and Kreps (1993) consider adaptive learning processes, in the spirit of ctitious play, for innnitely repeated games of incomplete information having randomly perturbed payoos. They proved the convergence of the adaptive process for 22 games with a unique completely mixed Nash equilibrium. Kaniovski and Young (1995) proved the convergence of the process for generic 2 2 games subjected ...
متن کاملLearning in games with unstable equilibria
We propose a new concept for the analysis of games, the TASP, which gives a precise prediction about non-equilibrium play in games whose Nash equilibria are mixed and are unstable under fictitious play-like learning processes. We show that, when players learn using weighted stochastic fictitious play and so place greater weight on more recent experience, the time average of play often converges...
متن کاملDirect Evolutionary Search for Nash Equilibria Detection
A Direct method of computing mixed form Nash equilibria of a normal form game by using a simple evolutionary algorithm is proposed. The Direct Evolutionary Search algorithm (DES) uses a generative relation for Nash equilibria with binary tournament selection and uniform mutation. Numerical experiments are used to illustrate the efficiency of the method.
متن کاملNeural Networks as a Learning Paradigm for General Normal Form Games1
GAMES1 LEONIDAS SPILIOPOULOS2,3 Abstract This paper addresses how neural networks learn to play one-shot normal form games through experience in an environment of randomly generated game payoffs and randomly selected opponents. This agent based computational approach allows the modeling of learning all strategic types of normal form games, irregardless of the number of pure and mixed strategy N...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1706.09763 شماره
صفحات -
تاریخ انتشار 2017